AUTOMATION, PARTIAL AND FULL
نویسندگان
چکیده
When some steps of a complex, multi-step task are automated, the demand for human work in remaining complementary sub-tasks goes up. In contrast, when is fully declines. Upon aggregation to macroeconomic scale, partial automatability complex tasks creates bottleneck development, where further growth constrained by scarcity essential work. This removed once become automatable. Theoretical analysis using two-level nested constant elasticity substitution production function specification demonstrates that shift from full automation generates non-convexity: humans and machines switch substitutable, share output accruing workers switches an upward downward trend. process has implications inequality, risk technological unemployment, likelihood secular stagnation.
منابع مشابه
Partial is Full
Link reversal is the basis of several well-known routing algorithms [10, 16, 12]. In these algorithms, logical directions are imposed on the communication links and a node that becomes a sink reverses some of its incident links to allow the (re)construction of paths to the destination. In the Full Reversal (FR) algorithm [10], a sink node reverses all its incident links. Other schemes have also...
متن کاملTowards Full Automation Of Lexicon Construction
We describe work in progress aimed at developing methods for automatically constructing a lexicon using only statistical data derived from analysis of corpora, a problem we call lexical optimization. Specifically, we use statistical methods alone to obtain information equivalent to syntactic categories, and to discover the semantically meaningful units of text, which may be multi-word units or ...
متن کاملGeneric Environment for Full Automation of Benchmarking
Regression testing is an important part of software quality assurance. We work to extend regression testing to include regression benchmarking, which applies benchmarking to detect regressions in performance. Given the specific requirements of regression benchmarking, many contemporary benchmarks are not directly usable in regression benchmarking. To overcome this, we present a case for designi...
متن کاملFrom Partial toward Full Parsing
Full-Parsing systems able to analyze sentences robustly and completely at an appropriate accuracy can be useful in many computer applications like information retrieval and machine translation systems. Increasing the domain of locality by using tree-adjoining-grammars (TAG) caused some researchers to use it as a modeling formalism in their language application. But parsing with a rich grammar l...
متن کاملNo more "Partial" and "Full Looking Ahead"
Looking ahead is a commonly used search technique in constraint satisfaction. In this paper, we examine the future role of two long established lookahead algorithms, Partial Looking Ahead (PLA) and Full Looking Ahead (FLA). We prove that PLA is inferior to Directional Arcconsistency Lookahead in that the latter will prune at least as much as the former for no more computation in each problem re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Macroeconomic Dynamics
سال: 2021
ISSN: ['1365-1005', '1469-8056']
DOI: https://doi.org/10.1017/s1365100521000031